complete subgraph
英
美
完全子图
双语例句
- On the Complete k-edge Colorable Subgraph
关于完全k-边可染子图 - Hopfield gives a method for finding the shortest Hamilton cycle using neural networks in N node complete graph Kn. In non-selfloop graph is regarded as the subgraph of KN, it will be easy to Obtain Hamilton cycle of Hamilton graph.
Hopfield给出N个节点完全图KN中求最短Hamilton圈的神经网络方法，若将无自环图看做KN的子图，不难求出Hamilton图的Hamilton圈。 - Application of maximum complete subgraph to management decisions
极大完全子图在管理决策中的应用 - We say G satisfies the property P_n, if Γ( G) contains no a complete subgraph consisting of n vertices in which any two ones are connected.
若Γ（G）中不含有由n个顶点构成的其中任意两点连通的完全子图，我们称G有性质Pn。 - A sufficient condition to decide a simple graph with a complete subgraph
简单图含有完全子图的一个充分条件 - We propose the definition of approximate acceptance with which we discuss the nonuniform complexity of the K sized complete subgraph problem.
本文提出逼近接受的概念，用来讨论K-团问题的非一致复杂性。 - Let K n ( p, q) be a complete graph of order n with red and blue edge coloring such that there is neither subgraph K p whose edges are all red nor subgraph K q whose edges are all blue.
以Kn（p，q）表示红蓝边染色的n阶完全图，图中既无p个顶点的红边完全子图，也无q个顶点的蓝边完全子图。 - We have obtained the chromatic polynomial of a graph G whose complement is the union of a complete bipartite graph and an empty graph by the ideal subgraph, and discussed the chromatic uniqueness of G.
依据理想子图的概念，得到了其补图为完全偶图及空图之并的图的色多项式，并讨论了这种图的色唯一性。 - The main contributions are as follows: Firstly, a novel scale-free network model based on clique ( complete subgraph of random size) growth and preferential attachment is proposed.
主要研究内容如下：提出了一个基于派系增长和优先连接的无标度网络模型。